منابع مشابه
Cubic graphs have bounded slope parameter
We show that every finite connected graph G with maximum degree three and with at least one vertex of degree smaller than three has a straight-line drawing in the plane satisfying the following conditions. No three vertices are collinear, and a pair of vertices form an edge in G if and only if the segment connecting them is parallel to one of the sides of a previously fixed regular pentagon. It...
متن کاملBounded-Degree Graphs can have Arbitrarily Large Slope Numbers
We construct graphs with n vertices of maximum degree 5 whose every straight-line drawing in the plane uses edges of at least n1/6−o(1) distinct slopes. A straight-line drawing of a graph G = (V (G), E(G)) is a layout of G in the plane such that the vertices are represented by distinct points, the edges are represented by (possibly crossing) line segments connecting the corresponding point pair...
متن کاملGirth six cubic graphs have Petersen minors
We prove that every 3-regular graph with no circuit of length less than six has a subgraph isomorphic to a subdivision of the Petersen graph. 3 January 1997 Revised 17 March 2014 ∗ Research partially performed under a consulting agreement with Bellcore, and partially supported by DIMACS Center, Rutgers University, New Brunswick, New Jersey 08903, USA. 1 Partially supported by NSF under Grant No...
متن کاملTotal domination in cubic Knodel graphs
A subset D of vertices of a graph G is a dominating set if for each u ∈ V (G) \ D, u is adjacent to somevertex v ∈ D. The domination number, γ(G) ofG, is the minimum cardinality of a dominating set of G. A setD ⊆ V (G) is a total dominating set if for eachu ∈ V (G), u is adjacent to some vertex v ∈ D. Thetotal domination number, γt (G) of G, is theminimum cardinality of a total dominating set o...
متن کاملParameter testing in bounded degree graphs of subexponential growth
Parameter testing algorithms are using constant number of queries to estimate the value of a certain parameter of a very large finite graph. It is well-known that graph parameters such as the independence ratio or the edit-distance from 3-colorability are not testable in bounded degree graphs. We prove, however, that these and several other interesting graph parameters are testable in bounded d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2010
ISSN: 1526-1719
DOI: 10.7155/jgaa.00196